On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
نویسندگان
چکیده
منابع مشابه
On semidefinite bounds for maximization of a non-convex quadratic objective over the l1 unit ball
We consider the non-convex quadratic maximization problem subject to the `1 unit ball constraint. The nature of the l1 norm structure makes this problem extremely hard to analyze, and as a consequence, the same difficulties are encountered when trying to build suitable approximations for this problem by some tractable convex counterpart formulations. We explore some properties of this problem, ...
متن کاملApproximation Bounds for Quadratic Maximization with Semidefinite Programming Relaxation
In this paper, we consider a class of quadratic maximization problems. One important instance in that class is the famous quadratic maximization formulation of the max-cut problem studied by Goemans and Williamson [6]. Since the problem is NP-hard in general, following Goemans and Williamson, we apply the approximation method based on the semidefinite programming (SDP) relaxation. For a subclas...
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملQuadratic maximization and semidefinite relaxation
In this paper we study a class of quadratic maximization problems and their semide nite program ming SDP relaxation For a special subclass of the problems we show that the SDP relaxation provides an exact optimal solution Another subclass which is NP hard guarantees that the SDP relaxation yields an approximate solution with a worst case performance ratio of This is a generalization of the well...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2006
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2006023